On bidding algorithms for a distributed combinatorial auction
نویسندگان
چکیده
منابع مشابه
On bidding algorithms for a distributed combinatorial auction
Combinatorial auctions (CAs) are a great way to solve complex resource allocation and coordination problems. However, CAs require a central auctioneer who receives the bids and solves the winner determination problem, an NP-hard problem. Unfortunately, a centralized auction is not a good fit for real world situations where the participants have proprietary interests that they wish to remain pri...
متن کاملApproximate Bidding Algorithms for a Distributed Combinatorial Auction (Short Paper)
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE a...
متن کاملApproximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE a...
متن کاملBidding strategy for agents in multi-attribute combinatorial double auction
In a multi-attribute combinatorial double auction (MACDA), sellers and buyers’ preferences over multiple synergetic goods are best satisfied. In recent studies in MACDA, it is typically assumed that bidders must know the desired combination (and quantity) of items and the bundle price. They do not address a package combination which is the most desirable to a bidder. This study presents a new p...
متن کاملAgents' Bidding Strategies in a Combinatorial Auction Controlled Grid Environment
We present an agent-based simulation environment for resource allocation in a distributed computer system that employs a combinatorial task scheduler. Our environment enables the simulation of a mechanism for the simultaneous allocation of resources like CPU time (CPU), communication bandwidth (NET), volatile (MEM) and non-volatile memory (DSK) in the distributed computer system. In contrast to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multiagent and Grid Systems
سال: 2011
ISSN: 1875-9076,1574-1702
DOI: 10.3233/mgs-2011-0170